Heuristic Algorithms for MapReduce Scheduling Problem with Open-Map Task and Series-Reduce Tasks
نویسندگان
چکیده
منابع مشابه
Evaluating map reduce tasks scheduling algorithms over cloud computing infrastructure
Efficiently scheduling MapReduce tasks is considered as one of the major challenges that face MapReduce frameworks. Many algorithms were introduced to tackle this issue. Most of these algorithms are focusing on the data locality property for tasks scheduling. The data locality may cause less physical resources utilization in non-virtualized clusters and more power consumption. Virtualized clust...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملGenetic Algorithms for Task Scheduling Problem
The scheduling and mapping of the precedence-constrained task graph to processors is considered to be the most crucial NP-complete problem in parallel and distributed computing systems. Several genetic algorithmshave beendeveloped to solve this problem.A common feature inmost of themhas been the use of chromosomal representation for a schedule. However, these algorithms aremonolithic, as they a...
متن کاملQoS Guided Heuristic Algorithms for Grid Task Scheduling
Due to the heterogeneity and geographically distribution of Grid resources, effective and efficient task scheduling algorithms are required. Resource load balancing and minimizing makespan are the fundamental goals of effective and efficient task scheduling. It becomes more complicated when various QoS demands arise from users. In this paper, we have presented two algorithms, QoS Guided Weighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2020
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2020/8810215